Ideal Point Guided Iterative Deepening
نویسندگان
چکیده
Many real world search problems involve different objectives, usually in conflict. In these cases the cost of a transition is given by a cost vector. This paper presents IPID, a new exact algorithm based on iterative deepening, that finds the set of all Paretooptimal paths for a search problem in a graph with vectorial costs. Formal proofs of the admissibility of IPID are presented, as well as the results of some empirical comparisons between IPID and other approaches based on iterative deepening. Empirical results show that IPID is usually faster than those approaches.
منابع مشابه
Depth-Bound Heuristics and Iterative-Deepening Search Algorithms in Classical Planning
Heuristics play an important role in classical planning. Using heuristics during state space search often reduces the time required to find a solution, but constructing heuristics and using them to calculate heuristic values takes time, reducing this benefit. Constructing heuristics and calculating heuristic values as quickly as possible is very important to the effectiveness of a heuristic. In...
متن کاملIterative Widening
We propose a method to gradually expand the moves to consider at the nodes of game search trees. The algorithm begins with an iterative deepening search using the minimal set of moves, and if the search does not succeed, iteratively widens the set of possible moves, performing a complete iterative deepening search after each widening. When designing carefully the different sets of possible move...
متن کاملHypothetical Planning
We present a novel method for interleaving planning with execution, called iterative deepening in hypotheticals. The method consists of performing an iterative deepening search in the space of partially ordered hypothetical plans. Hypothetical plans are partial plans in which the achievement of an otherwise unachievable goal may be conditioned on certain outcomes of sensing. This approach has b...
متن کاملEnhanced Iterative-Deepening Search
|Iterative-deepening searchesmimic a breadthrst node expansion with a series of depthrst searches that operate with successively extended search horizons. They have been proposed as a simple way to reduce the space complexity of bestrst searches like A* from exponential to linear in the search depth. But there is more to iterative-deepening than just a reduction of storage space. As we show, th...
متن کامل